Accurate Phylogenetic Tree Reconstruction from Quartets: A Heuristic Approach

نویسندگان

  • Rezwana Reaz
  • Md. Shamsuzzoha Bayzid
  • M. Sohel Rahman
چکیده

Supertree methods construct trees on a set of taxa (species) combining many smaller trees on the overlapping subsets of the entire set of taxa. A 'quartet' is an unrooted tree over 4 taxa, hence the quartet-based supertree methods combine many 4-taxon unrooted trees into a single and coherent tree over the complete set of taxa. Quartet-based phylogeny reconstruction methods have been receiving considerable attentions in the recent years. An accurate and efficient quartet-based method might be competitive with the current best phylogenetic tree reconstruction methods (such as maximum likelihood or Bayesian MCMC analyses), without being as computationally intensive. In this paper, we present a novel and highly accurate quartet-based phylogenetic tree reconstruction method. We performed an extensive experimental study to evaluate the accuracy and scalability of our approach on both simulated and biological datasets.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Linear Time Approximation Scheme for Maximum Quartet Consistency on Sparse Sampled Inputs

Phylogenetic tree reconstruction is a fundamental biological problem. Quartet amalgamation combining a set of trees over four taxa into a tree over the full set stands at the heart of many phylogenetic reconstruction methods. This task has attracted many theoretical as well as practical works. However, even reconstruction from a consistent set of quartet trees, i.e. all quartets agree with some...

متن کامل

Fast Error-Tolerant Quartet Phylogeny Algorithms

We present an algorithm for phylogenetic reconstruction using quartets that returns the correct topology for n taxa in O(n logn) time with high probability, in a probabilistic model where a quartet is not consistent with the true topology of the tree with constant probability, independent of other quartets. Our incremental algorithm relies upon a search tree structure for the phylogeny that is ...

متن کامل

Weighted quartets phylogenetics.

Despite impressive technical and theoretical developments, reconstruction of phylogenetic trees for enormous quantities of molecular data is still a challenging task. A key tool in analyses of large data sets has been the construction of separate trees for subsets (e.g., quartets) of sequences, and subsequent combination of these subtrees into a single tree for the full set (i.e., supertree ana...

متن کامل

Improving supertree estimation using Quartets MaxCut

Estimating the Tree of Life, an evolutionary tree describing how all life–several million extant species– evolved from a common ancestor, is one of the major scientific objectives facing modern biologists. However, this estimation problem is extremely computationally intensive, as the most accurate methods (e.g., maximum likelihood heuristics) are based upon attempts to solve NP-hard optimizati...

متن کامل

Quartet-Based Phylogeny Reconstruction from Gene Orders

Phylogenetic reconstruction from gene-rearrangement data is attracting increasing attention from biologists and computer scientists. Methods used in reconstruction include distance-based methods, parsimony methods using sequence encodings, and direct optimization. The latter, pioneered by Sankoff and extended by us with the software suite GRAPPA, is the most accurate approach; however, its exha...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره 9  شماره 

صفحات  -

تاریخ انتشار 2014